DIVCLUS-T: A monothetic divisive hierarchical clustering method
نویسندگان
چکیده
منابع مشابه
DIVCLUS-T: A monothetic divisive hierarchical clustering method
DIVCLUS-T is a divisive hierarchical clustering algorithm based on a monothetic bipartitional approach allowing the dendrogram of the hierarchy to be read as a decision tree. It is designed for either numerical or categorical data. Like the Ward agglomerative hierarchical clustering algorithm and the k-means partitioning algorithm, it is based on the minimization of the inertia criterion. Howev...
متن کاملMonothetic divisive clustering with geographical constraints
DIVCLUS-T is a descendant hierarchical clustering algorithm based on a monothetic bipartitional approach allowing the dendrogram of the hierarchy to be read as a decision tree. We propose in this paper a new version of this method called C-DIVCLUS-T which is able to take contiguity constraints into account. We apply C-DIVCLUS-T to hydrological areas described by agricultural and environmental v...
متن کاملA monothetic clustering method
The proposed divisive clustering method performs simultaneously a hierarchy of a set of objects and a monothetic characterization of each cluster of the hierarchy. A division is performed according to the within-cluster inertia criterion which is minimized among the bipartitions induced by a set of binary questions. In order to improve the clustering, the algorithm revises at each step the divi...
متن کاملDivisive Monothetic Clustering for Interval and Histogram-valued Data
We consider some classically based methods for fitting a multiple regression model to intervalvalued data (de Carvalho et al., 2004; Lima Neto et al., 2005; Lima Neto and de Carvalho, 2010). Then, a so-called symbolic model is fitted where now the regression parameters are estimated by using the symbolic sample covariance and variance functions of Billard (2008) and Bertrand and Goupil (2000). ...
متن کاملA divisive hierarchical clustering-based method for indexing image information
In most practical applications of image retrieval, high-dimensional feature vectors are required, but current multi-dimensional indexing structures lose their efficiency with growth of dimensions. Our goal is to propose a divisive hierarchical clustering-based multi-dimensional indexing structure which is efficient in high-dimensional feature spaces. A projection pursuit method has been used fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics & Data Analysis
سال: 2007
ISSN: 0167-9473
DOI: 10.1016/j.csda.2007.03.013